Advances in signatures, encryption, and E-Cash from bilinear groups
نویسنده
چکیده
We present new formal definitions, algorithms, and motivating applications for three natural cryptographic constructions. Our constructions are based on a special type of algebraic group called bilinear groups. 1. Re-Signatures: We present the first public key signature scheme where a semi-trusted proxy, given special information, can translate Alice’s signature on a message into Bob’s signature on the same message. The special information, however, allows nothing else, i.e., the proxy cannot translate from Bob to Alice, nor can it sign on behalf of either Alice or Bob. We show that a path through a graph can be cheaply authenticated using this scheme, with applications to electronic passports. 2. Re-Encryption: We present the first public key cryptosystem where a semi-trusted proxy, given special information, can translate an encryption of a message under Alice’s key into an encryption of the same message under Bob’s key. Again, the special information allows nothing else, i.e. the proxy cannot translate from Bob to Alice, decrypt on behalf of either Alice or Bob, or learn anything else about the message. We apply this scheme to create a new mechanism for secure distributed storage. 3. Compact E-Cash with Tracing and Bounded-Anonymity: We present an offline e-cash system where 2 coins can be stored in O(`+ k) bits and withdrawn or spent in O(`+ k) time, where k is the security parameter. The best previously known schemes required at least one of these complexities to be O(2 · k). In our system, a user’s transactions are anonymous and unlinkable, unless she performs a forbidden action, such as double-spending a coin. Performing a forbidden action reveals the identity of the user, and optionally allows to trace all of her past transactions. We provide solutions without using a trusted party. We argue why features of our system are likely to be crucial to the adoption of any e-cash system. Thesis Supervisor: Ronald L. Rivest Title: Viterbi Professor of Electrical Engineering and Computer Science
منابع مشابه
Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings
Verifiably encrypted signatures are used when Alice wants to sign a message for Bob but does not want Bob to possess her signature on the message until a later date. Such signatures are used in optimistic contact signing to provide fair exchange. Partially blind signature schemes are an extension of blind signature schemes that allows a signer to sign a partially blinded message that include pr...
متن کاملA Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model
In this work, we present a generic framework for constructing efficient signature schemes, ring signature schemes, and identity based encryption schemes, all in the standard model (without relying on random oracles). We start by abstracting the recent work of Hohenberger and Waters (Crypto 2009), and specifically their “prefix method”. We show a transformation taking a signature scheme with a v...
متن کاملAn Efficient Electronic Cash Scheme with Multiple Banks Using Group Signature
In 2008, an electronic cash scheme with multiple banks based on group signatures was proposed by Wang et al. They adopted a group blind signature scheme based on bilinear pairings to generate the electronic cash and it can be verified by the bilinear pairings operation. However, we find some security problems in their approach. By the way, the cost of communication and computation in their sche...
متن کاملEfficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability
In this work, we first formalize the notion of dynamic group signatures with distributed traceability, where the capability to trace signatures is distributed among nmanagers without requiring any interaction. This ensures that only the participation of all tracing managers permits tracing a signature, which reduces the trust placed in a single tracing manager. The threshold variant follows eas...
متن کاملStructure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
Structure-preserving cryptography is a world where messages, signatures, ciphertexts and public keys are entirely made of elements of a group over which a bilinear map is efficiently computable. While structure-preserving signatures have received much attention the last 6 years, structure-preserving encryption schemes have undergone slower development. In particular, the best known structure-pr...
متن کامل